#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define in read<int>()
#define lin read<ll>()
#define rep(i, x, y) for(int i = (x); i <= (y); i++)
#define per(i, x, y) for(int i = (x); i >= (y); i--)

using namespace std;

using ll = long long;
using db = double;
using pii = pair < int, int >;
using vec = vector < int >;
using veg = vector < pii >;

template < typename T > T read() {
	T x = 0; bool f = 0; char ch = getchar();
	while(!isdigit(ch)) f |= ch == '-', ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar();
	return f ? -x : x;
}

template < typename T > void chkmax(T &x, const T &y) { x = x > y ? x : y; }
template < typename T > void chkmin(T &x, const T &y) { x = x < y ? x : y; }

const int N = 3e5 + 10;

int a[N], n;
int ans[N], f[N], g[N];

int main() {
#ifndef ONLINE_JUDGE
	freopen("1.in", "r", stdin);
#endif
	n = in; rep(i, 1, n) a[i] = in, chkmax(ans[1], a[i]);
	rep(i, 2, n - 1) f[i] = max(a[i], a[i + 1]);
	rep(i, 2, n - 1) g[i - 1] = max(min(a[i], a[i - 1]), min(a[i], a[i + 1]));
	per(i, n >> 1, 1) {
		ans[i << 1] = max({ ans[i + 1 << 1], f[i], f[n - i] });
		ans[i << 1 | 1] = max({ ans[i + 1 << 1 | 1], g[i], g[n - i - 1] });
	} per(i, n, 1) printf("%d ", ans[i]);
	puts("");
	return 0;
}
